A Group Mutual Exclusion Algorithm for Ad Hoc Mobile Networks
نویسنده
چکیده
In this paper, we propose a token based algorithm to solve the group mutual exclusion (GME) problem for ad hoc mobile networks. The proposed algorithm is adapted from the RL algorithm in [WWV98] and utilizes the concept of weight throwing in [Tse95]. We prove that the proposed algorithm satisfies the mutual exclusion, the bounded delay, and the concurrent entering properties. The proposed algorithm is sensitive to link forming and link breaking and thus is suitable for ad hoc mobile networks.
منابع مشابه
A Weight-Throwing Clustering Group Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
A mobile ad hoc network can be defined as a network that is spontaneously deployed and is independent of any static network. The network consists of mobiles nodes with wireless interfaces and has arbitrary dynamic topology. The network suffers from frequent link formation and disruption due to the mobility of the nodes. A clustering method is used for obtaining a hierarchical organization for t...
متن کاملA Permission-based Clustering Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks
In the last ten years a lot of research has been done on resource allocation in Ad-hoc networks. The Classical approaches of mutual exclusion and its variants need to be modified to suit the dynamic topology, low bandwidth and low processing capabilities of mobile ad-hoc network (MANET).The distributed mutual exclusion in MANETs is comparatively less explored area of research. In this paper, we...
متن کاملA Mutual Exclusion Algorithm for Ad Hoc Mobile Networks
A fault-tolerant distributed mutual exclusion algorithm that adjusts to node mobility is presented, along with proof of correctness and simulation results. The algorithm requires nodes to communicate with only their current neighbors, making it well-suited to the ad hoc environment. Experimental results indicate that adaptation to mobility can improve performance over that of similar non-adapti...
متن کاملExclusion mutuelle de groupes dans les systèmes distribués. (Group mutual exclusion in distributed systems)
Group mutual exclusion is an interesting generalization of the mutual exclusion problem. This problem was introduced by Joung, and some algorithms for the problem have been proposed by incorporating mutual exclusion algorithms. Group mutual exclusion occurs naturally in a situation where a resource can be shared by processes of the same group, but not by processes of different groups. It is als...
متن کاملCluster Based Cross Layer Intelligent Service Discovery for Mobile Ad-Hoc Networks
The ability to discover services in Mobile Ad hoc Network (MANET) is a major prerequisite. Cluster basedcross layer intelligent service discovery for MANET (CBISD) is cluster based architecture, caching ofsemantic details of services and intelligent forwarding using network layer mechanisms. The cluster basedarchitecture using semantic knowledge provides scalability and accuracy. Also, the mini...
متن کامل